Geometrical Computation and Computable Analysis
نویسنده
چکیده
Geometrical Computation and Computable Analysis Abstract Geometrical Computation and Computable Analysis Jérôme Durand-LoseGeometrical Computation and Computable Analysis Jérôme Durand-Lose Laboratoire d’Informatique Fondamentale d’Orléans, Université d’Orléans, Orléans, FRANCE Unconventional Computation ’09 Sep. 9th, 2009 — Ponta Delgada, Azores, Portugal Abstract Geometrical Computation and Computable AnalysisGeometrical Computation and Computable Analysis Context: Analog computation Computing over R no Church-Turing Thesis how does the various models relate? Computable analysis [Weihrauch, 2000] based on converging sequences of approximations approximations are discrete values handled in the classical context Abstract Geometrical Computation. . . continuous counterpart of cellular automata idealized collision based computing . . . is a new model that needs more introduction Abstract Geometrical Computation and Computable AnalysisGeometrical Computation and Computable Analysis 1 Abstract Geometrical Computation 2 Representation of real numbers 3 Manipulation of approximations 4 Finite duration and putting all together
منابع مشابه
geometrical computation 5 : embedding computable analysis
geometrical computation 5: embedding computable analysis
متن کاملGeometrical Accumulations and Computably Enumerable Real Numbers
Abstract geometrical computation involves drawing colored line segments (traces of signals) according to rules: signals with similar color are parallel and when they intersect, they are replaced according to their colors. Time and space are continuous and accumulations can be devised to unlimitedly accelerate a computation and provide, in a finite duration, exact analog values as limits. In the...
متن کاملComputation of the NMR Parameters of H-Capped (10,0) and (5,5) Single-Walled SiC Nanotubes
Geometrical structure, nuclear magnetic resonance (N1,1It) chemical shielding tensors, and chemical shiftsof silicon and carbon nucler are investigated for twn infinite size zigzag and armchair single-walled siliconcarbide nanotabes (SiCNTs). Geometrical structures of SieNTs, Sit bonds and bond angles of St and Cvertices in both zigzag and armchair nanotubes, Indicate that bond lengths are appr...
متن کاملThe General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation
In this paper we revisit one of the first models of analog computation, Shannon’s General Purpose Analog Computer (GPAC). The GPAC has often been argued to be weaker than computable analysis. As main contribution, we show that if we change the notion of GPACcomputability in a natural way, we compute exactly all real computable functions (in the sense of computable analysis). Moreover, since GPA...
متن کامل